The complement problem for linklessly embeddable graphs
نویسندگان
چکیده
We find all maximal linklessly embeddable graphs of order up to 11, and verify that for every graph [Formula: see text] 11 either or its complement is intrinsically linked. give an example a such both are text]-minor free. provide minimal examples not triangular three-connected. prove Nordhaus–Gaddum-type conjecture on the Colin de Verdière invariant at most vertices. description programs used in search.
منابع مشابه
Distributed Approximation Algorithms for k-dominating Set in Graphs of Bounded Genus and Linklessly Embeddable Graphs
A k-dominating set in a graph G = (V,E) is a set U ⊆ V such that ever vertex of G is either in U or has at least k neighbors in U . In this paper we give simple distributed approximation algorithms in the local model for the minimum k-dominating set problem for k ≥ 2 in graphs with no K3,h-minor and graphs with no K4,4-minor. In particular, this gives fast distributed approximations for graphs ...
متن کاملA Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs
For any undirected graph G, let μ(G) be the graph parameter introduced by Colin de Verdière. In this paper we show that μ(G) ≤ 4 if and only if G is linklessly embeddable (in R). This forms a spectral characterization of linklessly embeddable graphs, and was conjectured by Robertson, Seymour, and Thomas. A key ingredient is a Borsuk-type theorem on the existence of a pair of antipodal linked (k...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولOn cyclically embeddable graphs
An embedding of a simple graph G into its complement G is a permutation σ on V (G) such that if an edge xy belongs to E(G), then σ(x)σ(y) does not belong to E(G). In this note we consider some families of embeddable graphs such that the corresponding permutation is cyclic.
متن کاملClin d’oeil on Lj-embeddable planar graphs
In this note we present some properties of LI-embeddable planar graphs. We present a characterization of graphs isometrically embeddable into half-cubes. This result implies that every planar Li-graph G has a scale 2 embedding into a hypercube. Further, under some additional conditions we show that for a simple circuit C of a planar Li-graph G the subgraph H of G bounded by C is also Li-embedda...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Knot Theory and Its Ramifications
سال: 2022
ISSN: ['1793-6527', '0218-2165']
DOI: https://doi.org/10.1142/s0218216522500754